Limit distribution for the maximum degree of a random recursive tree
نویسندگان
چکیده
منابع مشابه
Limit distribution for the maximum degree of a random recursive tree
If a recursive tree is selected uniformly at random from among all recursive trees on n vertices, then the distribution of the maximum in-degree is given asymptotically by the following theorem: for any 3xed integer d, Pn( 6 n + d)= exp(−2{ n}−d−1) + o(1) as n → ∞; where n = log2 n. (As usual, n denotes the greatest integer less than or equal to n, and { n}= n− n :) The proof makes extensive us...
متن کاملLimit distribution of the degrees in scaled attachment random recursive trees
We study the limiting distribution of the degree of a given node in a scaled attachment random recursive tree, a generalized random recursive tree, which is introduced by Devroye et. al (2011). In a scaled attachment random recursive tree, every node $i$ is attached to the node labeled $lfloor iX_i floor$ where $X_0$, $ldots$ , $X_n$ is a sequence of i.i.d. random variables, with support in [0,...
متن کاملAsymptotic degree distribution in random recursive trees
The distributions of vertex degrees in random recursive trees and random plane recursive trees are shown to be asymptotically normal. Formulas are given for the asymptotic variances and covariances of the number of vertices with given outdegrees. We also give functional limit theorems for the evolution as vertices are added. The proofs use some old and new results about generalized Pólya urn mo...
متن کاملThe Maximum Degree of the Barabasi-Albert Random Tree
In the classical Erdős–Rényi model of random graphs, when the number of edges is proportional to the number of vertices, the degree distribution is approximately Poisson with a tail decreasing even faster than exponentially. However, in many real life networks power law degree distributions were observed with different exponents. To introduce a more realistic model for the evolution of random n...
متن کاملlimit distribution of the degrees in scaled attachment random recursive trees
we study the limiting distribution of the degree of a given node in a scaled attachment random recursive tree, a generalized random recursive tree, which is introduced by devroye et. al (2011). in a scaled attachment random recursive tree, every node $i$ is attached to the node labeled $lfloor ix_i floor$ where $x_0$, $ldots$ , $x_n$ is a sequence of i.i.d. random variables, with support in [0,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2002
ISSN: 0377-0427
DOI: 10.1016/s0377-0427(01)00460-5